An improved training algorithm in HMM-based speech recognition
نویسندگان
چکیده
In HMM-based speech recognition, estimation of parameters of HMMs is viewed as counterpart of training or learning in traditional sequential pattern recognition since speech signal can be represented by a sequence of ndimension vectors after features are extracted from the speech signal. However, due to variation of duration of the phone with speakers and context and its randomness, speech samples contribute differently to estimation of parameters of HMMs. While only smaller training set is accessible, for instance, in the case of speaker adaptation, the problem becomes very serious. In this paper, we analyze the impact of different duration of the phone on the output probability likelihood. To combat the above problem, two approaches are proposed to make proportionate the contribution of speech samples to estimation of parameters of HMM: geometrically averaged probability likelihood method and centralized parametric space method. Several experiments are conducted to verify the advantage of the above approaches in HMM-based speech recognition. The results show that the recognition rate can be improved to a certain degree when any one of the above approaches is employed.
منابع مشابه
Improving Phoneme Sequence Recognition using Phoneme Duration Information in DNN-HSMM
Improving phoneme recognition has attracted the attention of many researchers due to its applications in various fields of speech processing. Recent research achievements show that using deep neural network (DNN) in speech recognition systems significantly improves the performance of these systems. There are two phases in DNN-based phoneme recognition systems including training and testing. Mos...
متن کاملSpeech enhancement based on hidden Markov model using sparse code shrinkage
This paper presents a new hidden Markov model-based (HMM-based) speech enhancement framework based on the independent component analysis (ICA). We propose analytical procedures for training clean speech and noise models by the Baum re-estimation algorithm and present a Maximum a posterior (MAP) estimator based on Laplace-Gaussian (for clean speech and noise respectively) combination in the HMM ...
متن کاملAn Evolutionary Programming Based Algorithm for HMM training
In this paper, we propose an evolutionary programming (EP) based algorithm for the training of hidden Markov models (HMMs), which are applied to automatic speech recognition. This algorithm (called the EP algorithm) uses specially designed operators of mutation and selection to find the HMM parameters and the number of states. In order to evaluate the recognition capability of the HMMs trained ...
متن کاملEnhancing Speech Recognition Using Improved Particle Swarm Optimization Based Hidden Markov Model
Enhancing speech recognition is the primary intention of this work. In this paper a novel speech recognition method based on vector quantization and improved particle swarm optimization (IPSO) is suggested. The suggested methodology contains four stages, namely, (i) denoising, (ii) feature mining (iii), vector quantization, and (iv) IPSO based hidden Markov model (HMM) technique (IP-HMM). At fi...
متن کاملAn improved maximum model distance approach for HMM-based speech recognition systems
This paper proposes an improved maximum model distance (IMMD) approach for HMM-based speech recognition systems based on our previous work [S. Kwong, Q.H. He, K.F. Man, K.S. Tang. A maximum model distance approach for HMM-based speech recognition, Pattern Recognition 31 (3) (1998) 219}229]. It de"nes a more realistic model distance de"nition for HMM training, and utilizes the limited training d...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1996